Fully Proportional Representation as Resource Allocation: Approximability Results
نویسندگان
چکیده
We study the complexity of (approximate) winner determination underMonroe’s and ChamberlinCourant’s multiwinner voting rules, where we focus on the total (dis)satisfaction of the voters (the utilitarian case) or the (dis)satisfaction of the worstoff voter (the egalitarian case). We show good approximation algorithms for the satisfaction-based utilitarian cases, and inapproximability results for the remaining settings.
منابع مشابه
Proportional Representation as Resource Allocation: Approximability Results
We model Monroe’s and Chamberlin and Courant’s multiwinner voting systems as a certain resource allocation problem. We show that for many restricted variants of this problem, under standard complexity-theoretic assumptions there are no constant-factor approximation algorithms. Yet, we also show cases where good approximation algorithms exist (these variants correspond to optimizing total voter ...
متن کاملSub-Carrier Allocation in OFDM Systems: Complexity, Approximability and Algorithms
Orthogonal Frequency Division Multiplexing (OFDM) has become the de facto standard for fourth generation wireless networks[5]. In such a network, the frequency band is divided into numerous orthogonal sub-carriers. In each time-slot, disjoint sets of sub-carriers can be assigned to users based on some target objective. The users in turn transmit data by spreading the information across the assi...
متن کاملCross-layer Packet-dependant OFDM Scheduling Based on Proportional Fairness
This paper assumes each user has more than one queue, derives a new packet-dependant proportional fairness power allocation pattern based on the sum of weight capacity and the packet’s priority in users’ queues, and proposes 4 new cross-layer packet-dependant OFDM scheduling schemes based on proportional fairness for heterogeneous classes of traffic. Scenario 1, scenario 2 and scenario 3 lead r...
متن کاملApproximability and Inapproximability of Social Welfare Optimization in Multiagent Resource Allocation
Resource allocation is a fundamental problem in the field of multiagent systems, where a set of resources need to be allocated to a group of agents in a way so as to optimizing social welfare. In the last few years this problem has received much attention, especially due to its wide applicability domain (see the survey of Chevaleyre et al. [CDE+06]). This thesis studies the approximability and ...
متن کاملComplexity and Approximability of Social Welfare Optimization in Multiagent Resource Allocation
A central task in multiagent resource allocation, which provides mechanisms to allocate (bundles of) resources to agents, is to maximize social welfare. We assume resources to be indivisible and nonshareable and agents to express their utilities over bundles of resources, where utilities can be represented in the bundle form, the k-additive form, and as straight-line programs. We study the comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013